On-the-fly Probabilistic Model Checking

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-the-fly Probabilistic Model Checking

Model checking approaches can be divided into two broad categories: global approaches that determine the set of all states in a model M that satisfy a temporal logic formula Φ, and local approaches in which, given a state s in M , the procedure determines whether s satisfies Φ. When s is a term of a process language, the model-checking procedure can be executed “on-the-fly”, driven by the synta...

متن کامل

Truly On-the-Fly LTL Model Checking

We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a varia...

متن کامل

On-the-Fly Model Checking for Extended Action-Based Probabilistic Operators

The quantitative analysis of concurrent systems requires expressive and user-friendly property languages combining temporal, datahandling, and quantitative aspects. In this paper, we aim at facilitating the quantitative analysis of systems modeled as PTSs (Probabilistic Transition Systems) labeled by actions containing data values and probabilities. We propose a new regular probabilistic operat...

متن کامل

Model Checking with Fly-Automata

The verification of monadic second-order (MSO) graph properties, equivalently, the model-checking problem for MSO logic over finite binary relational structures, is fixed-parameter tractable (FPT) where the parameter consists of the formula that expresses the property and the tree-width or the clique-width of the input graph or structure. How to build usable algorithms for this problem? The pro...

متن کامل

Probabilistic Model Checking

Markov chains (MC) and Markov decision processes (MDP) are widely used as operational models for the quantitative system analysis. They can be understood as transition systems augmented with distributions for the states (in MC) or state-action pairs (in MDPs) to specify the probabilities for the successor states. Additionally one might add weight functions for modeling accumulated costs or rewa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2014

ISSN: 2075-2180

DOI: 10.4204/eptcs.166.6